Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021

Neighborhood Parallel Simulated Annealing

A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems

0377-2217/$ see front matter 2009 Elsevier B.V. A doi:10.1016/j.ejor.2009.09.014 * Corresponding author. Tel.: +86 592 5918207; fax E-mail address: [email protected] (D. Zhang). This paper approximately solves the high school timetabling problem using a simulated annealing based algorithm with a newly-designed neighborhood structure. In search for the best neighbor, the heuristic performs a se...

Multi-start simulated annealing for dynamic plant layout problem

In today’s dynamic market, organizations must be adaptive to market fluctuations. In addition, studies show that material-handling cost makes up between 20 and 50 percent of the total operating cost. Therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearr...

Neighborhood Size in the Simulated Annealing Algorithm

Simulated annealing is a probabilistic algorithm that has shown some promise when applied to combinatorially NP-hard problems. One advantage of the simulated annealing algorithm is that it is based on an analogy with statistical mechanics which is not problem-specific. However, any implementation of the algorithm for a given problem requires that several specific choices be made. The success or...

A Simulated Annealing Hyper-heuristic for University Course Timetabling

The university course timetabling problem involves assigning a given number of events (including lectures, seminars, labs, tutorials, etc) into a limited number of timeslots and rooms subject to given set of constraints. Two primary hard constraints are that no student should be assigned two events in one timeslot and that capacity and features of rooms should satisfy the requirement of the eve...